Characters of independent Stanley sequences

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Runs in Independent Sequences

Given an i.i.d. sequence of n letters from a finite alphabet, we consider the length of the longest run of any letter. In the equiprobable case, results for this run turn out to be closely related to the well-known results for the longest run of a given letter. For coin-tossing, tail probabilities are compared for both kinds of runs via Poisson approximation.

متن کامل

On generalized Stanley sequences

Let N denote the set of all nonnegative integers. Let k ≥ 3 be an integer and A0 = {a1, . . . , at} (a1 < . . . < at) be a nonnegative set which does not contain an arithmetic progression of length k. We denote A = {a1, a2, . . . } defined by the following greedy algorithm: if l ≥ t and a1, . . . , al have already been defined, then al+1 is the smallest integer a > al such that {a1, . . . , al}...

متن کامل

Novel structures in Stanley sequences

Given a set of integers with no three in arithmetic progression, we construct a Stanley sequence by adding integers greedily so that no arithmetic progression is formed. This paper offers two main contributions to the theory of Stanley sequences. First, we characterize well-structured Stanley sequences as solutions to constraints in modular arithmetic, defining the modular Stanley sequences. Se...

متن کامل

On the growth of Stanley sequences

A set is said to be 3-free if no three elements form an arithmetic progression. Given a 3-free set A of integers 0 = a0 < a1 < · · · < at, the Stanley sequence S(A) = {an} is defined using the greedy algorithm: For each successive n > t, we pick the smallest possible an so that {a0, a1, . . . , an} is 3-free and increasing. Work by Odlyzko and Stanley indicates that Stanley sequences may be div...

متن کامل

A Further Note on Runs in Independent Sequences

Given a sequence of letters generated independently from a finite alphabet, we consider the case when more than one, but not all, letters are generated with the highest probability. The length of the longest run of any of these letters is shown to be one greater than the length of the longest run in a particular state of an associated Markov chain. Using results of Foulser and Karlin (19...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2018

ISSN: 0195-6698

DOI: 10.1016/j.ejc.2018.01.008